From DIOID Algebra to P-Time Event Graphs

Abstract: The (max,+) algebra is usually used to model Timed event graph. In this paper, we show that P-time event graphs which extend Timed event graph, can be modelled using maximum, minimum and addition operations. The result is a new model called interval descriptor system where the time evolution is not strictly deterministic but belongs to intervals. The cycle-time vector allows us to to check its correct behaviour and to verify the existence of a state trajectory. Particularly, it detects the presence of token-deads which can generate a deadlock.